Distinguishing Trees in Linear Time
نویسندگان
چکیده
منابع مشابه
Distinguishing Trees in Linear Time
4 A graph is said to be d-distinguishable if there exists a d-labeling of its vertices which is 5 only preserved by the identity map. The distinguishing number of a graph G is the smallest 6 number d for which G is d-distinguishable. We show that the distinguishing number of trees 7 and forests can be computed in linear time, improving the previously known O(n log n) time 8 algorithm. 9
متن کاملMinimax Trees in Linear Time
A minimax tree is similar to a Huffman tree except that, instead of minimizing the weighted average of the leaves’ depths, it minimizes the maximum of any leaf’s weight plus its depth. Golumbic (1976) introduced minimax trees and gave a Huffman-like, O(n log n)-time algorithm for building them. Drmota and Szpankowski (2002) gave another O(n log n)-time algorithm, which checks the Kraft Inequali...
متن کاملAlphabetic Minimax Trees in Linear Time
We develop a linear time algorithm algorithm for the following problem: given an ordered sequence of n real weights w1, w2, . . . , wn, construct a binary tree on n leaves labeled with those weights when read from left to right so that the maximum value of wi plus depth of the i-th leftmost leaf is minimized. This improves the previously known O(n logn) time solutions [2,11,13]. We also give a ...
متن کاملBuilding PQR trees in almost-linear time
In 1976, Booth and Leuker invented the PQ trees as a compact way of storing and manipulating all the permutations on n elements that keep consecutive the elements in certain given sets C1, C2, . . . , Cm. Such permutations are called valid. This problem finds applications in DNA physical mapping, interval graph recognition, logic circuit optimization and data retrieval, among others. PQ trees c...
متن کاملOptimal Integer Alphabetic Trees in Linear Time
We show that optimal alphabetic binary trees can be constructed in O(n) time if the elements of the initial sequence are drawn from a domain that can be sorted in linear time. We describe a hybrid algorithm that combines the bottom-up approach of the original Hu-Tucker algorithm with the top-down approach of Larmore and Przytycka’s Cartesian tree algorithms. The hybrid algorithm demonstrates th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 2012
ISSN: 1077-8926
DOI: 10.37236/2285